MusicSarreV3, Main, Exploration, bibRecord, 000538

Some Results for Elementary Operations

Identifieur interne : 000538 ( Main/Exploration ); précédent : 000537; suivant : 000539

Some Results for Elementary Operations

Auteurs : Athanasios K. Tsakalidis [Grèce]

Source :

Lecture Notes in Computer Science [ 0302-9743 ] ; 2009.

RBID : ISTEX:718B08710952C2B2A9DFC6CCA49E70D968A9F41F

English descriptors

Teeft :
- Abstract data type, Acta informatica, Algorithm, Approximate string, Arbitrary insertions, Arbitrary subinterval, Arbitrary tree, Arithmetic capabilities, Comput, Computational geometry, Computer science, Constant time, Data structure, Data structures, Deletion, Discrete algorithms, Dynamic case, Dynamic interpolation search, Elementary operations, Finger search, Heidelberg, High probability, Insertion, Interpolation search, Intersection queries, Intersection query problems, Kitsios, Line elimination, Linear space, List manipulation, Lncs, Localized search, Main memory, Makris, Mehlhorn, Multidimensional search, Negative cycle, Node, Optimal space, Parallel implementation, Persistent data structures, Pointer, Pointer machine, Pointer machines, Preprocessing time, Present algorithms, Priority queue, Priority queues, Probability distribution, Proc, Pure pointer machine, Query, Query time, Queue, Rectangle, Rectangle enclosure, Rectangle enclosure problem, Same time, Second version, Smooth distribution, Space bounds, Space cost, Springer, String manipulation, String regularities, Tarjan, Temporal precedence, Temporal precedence problem, Time complexity, Tsakalidis, Tsichlas, Upper bounds, Weighted sequences, Weighted tree, Worst case.

Abstract

Abstract: We present a number of results for elementary operations concerning the areas of data structures, computational geometry, graph algorithms and string algorithms. Especially, we focus on elementary operations like the dictionary operations, list manipulation, priority queues, temporal precedence, finger search, nearest common ancestors, negative cycle, 3-sided queries, rectangle enclosure, dominance searching, intersection queries, hidden line elimination and string manipulation.

Url:

https://api.istex.fr/document/718B08710952C2B2A9DFC6CCA49E70D968A9F41F/fulltext/pdf

DOI: 10.1007/978-3-642-03456-5_8

Affiliations:

Grèce

Links toward previous steps (curation, corpus...)

to stream Istex, to step Corpus: 000B97
to stream Istex, to step Curation: 000B40
to stream Istex, to step Checkpoint: 000375
to stream Main, to step Merge: 000538
to stream Main, to step Curation: 000538

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Some Results for Elementary Operations</title>
<author><name sortKey="Tsakalidis, Athanasios K" sort="Tsakalidis, Athanasios K" uniqKey="Tsakalidis A" first="Athanasios K." last="Tsakalidis">Athanasios K. Tsakalidis</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:718B08710952C2B2A9DFC6CCA49E70D968A9F41F</idno>
<date when="2009" year="2009">2009</date>
<idno type="doi">10.1007/978-3-642-03456-5_8</idno>
<idno type="url">https://api.istex.fr/document/718B08710952C2B2A9DFC6CCA49E70D968A9F41F/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000B97</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000B97</idno>
<idno type="wicri:Area/Istex/Curation">000B40</idno>
<idno type="wicri:Area/Istex/Checkpoint">000375</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000375</idno>
<idno type="wicri:doubleKey">0302-9743:2009:Tsakalidis A:some:results:for</idno>
<idno type="wicri:Area/Main/Merge">000538</idno>
<idno type="wicri:Area/Main/Curation">000538</idno>
<idno type="wicri:Area/Main/Exploration">000538</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Some Results for Elementary Operations</title>
<author><name sortKey="Tsakalidis, Athanasios K" sort="Tsakalidis, Athanasios K" uniqKey="Tsakalidis A" first="Athanasios K." last="Tsakalidis">Athanasios K. Tsakalidis</name>
<affiliation wicri:level="1"><country xml:lang="fr">Grèce</country>
<wicri:regionArea>Department of Computer Engineering and Informatics, University of Patras, 26501, Patras</wicri:regionArea>
<wicri:noRegion>Patras</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Grèce</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2009</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Abstract data type</term>
<term>Acta informatica</term>
<term>Algorithm</term>
<term>Approximate string</term>
<term>Arbitrary insertions</term>
<term>Arbitrary subinterval</term>
<term>Arbitrary tree</term>
<term>Arithmetic capabilities</term>
<term>Comput</term>
<term>Computational geometry</term>
<term>Computer science</term>
<term>Constant time</term>
<term>Data structure</term>
<term>Data structures</term>
<term>Deletion</term>
<term>Discrete algorithms</term>
<term>Dynamic case</term>
<term>Dynamic interpolation search</term>
<term>Elementary operations</term>
<term>Finger search</term>
<term>Heidelberg</term>
<term>High probability</term>
<term>Insertion</term>
<term>Interpolation search</term>
<term>Intersection queries</term>
<term>Intersection query problems</term>
<term>Kitsios</term>
<term>Line elimination</term>
<term>Linear space</term>
<term>List manipulation</term>
<term>Lncs</term>
<term>Localized search</term>
<term>Main memory</term>
<term>Makris</term>
<term>Mehlhorn</term>
<term>Multidimensional search</term>
<term>Negative cycle</term>
<term>Node</term>
<term>Optimal space</term>
<term>Parallel implementation</term>
<term>Persistent data structures</term>
<term>Pointer</term>
<term>Pointer machine</term>
<term>Pointer machines</term>
<term>Preprocessing time</term>
<term>Present algorithms</term>
<term>Priority queue</term>
<term>Priority queues</term>
<term>Probability distribution</term>
<term>Proc</term>
<term>Pure pointer machine</term>
<term>Query</term>
<term>Query time</term>
<term>Queue</term>
<term>Rectangle</term>
<term>Rectangle enclosure</term>
<term>Rectangle enclosure problem</term>
<term>Same time</term>
<term>Second version</term>
<term>Smooth distribution</term>
<term>Space bounds</term>
<term>Space cost</term>
<term>Springer</term>
<term>String manipulation</term>
<term>String regularities</term>
<term>Tarjan</term>
<term>Temporal precedence</term>
<term>Temporal precedence problem</term>
<term>Time complexity</term>
<term>Tsakalidis</term>
<term>Tsichlas</term>
<term>Upper bounds</term>
<term>Weighted sequences</term>
<term>Weighted tree</term>
<term>Worst case</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We present a number of results for elementary operations concerning the areas of data structures, computational geometry, graph algorithms and string algorithms. Especially, we focus on elementary operations like the dictionary operations, list manipulation, priority queues, temporal precedence, finger search, nearest common ancestors, negative cycle, 3-sided queries, rectangle enclosure, dominance searching, intersection queries, hidden line elimination and string manipulation.</div>
</front>
</TEI>
<affiliations><list><country><li>Grèce</li>
</country>
</list>
<tree><country name="Grèce"><noRegion><name sortKey="Tsakalidis, Athanasios K" sort="Tsakalidis, Athanasios K" uniqKey="Tsakalidis A" first="Athanasios K." last="Tsakalidis">Athanasios K. Tsakalidis</name>
</noRegion>
<name sortKey="Tsakalidis, Athanasios K" sort="Tsakalidis, Athanasios K" uniqKey="Tsakalidis A" first="Athanasios K." last="Tsakalidis">Athanasios K. Tsakalidis</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000538 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000538 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Sarre
   |area=    MusicSarreV3
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:718B08710952C2B2A9DFC6CCA49E70D968A9F41F
   |texte=   Some Results for Elementary Operations
}}

This area was generated with Dilib version V0.6.33.
Data generation: Sun Jul 15 18:16:09 2018. Site generation: Tue Mar 5 19:21:25 2024

	Serveur d'exploration sur la musique en Sarre
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la musique en Sarre

Some Results for Elementary Operations

Some Results for Elementary Operations

Source :

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri